Optimistic concurrency control by melding trees
نویسندگان
چکیده
منابع مشابه
Optimistic Concurrency Control by Melding Trees
This paper describes a new optimistic concurrency control algorithm for tree-structured data called meld. Each transaction executes on a snapshot of a multiversion database and logs a record with its intended updates. Meld processes log records in log order on a cached partial-copy of the last committed state to determine whether each transaction commits. If so, it merges the transaction’s upda...
متن کاملAnalysis of Optimistic Concurrency Control Revisited
Ryu and Thomasian have analyzed several varieties of optimistic concurrency control under two assumptions: that the characteristics of a transaction remain constant throughout its execution, and that the proportion of committing transactions is xed (in order to avoid an unrealistic biasing of the transaction mixture). We show how both of these assumptions can be relaxed. First, we allow an abor...
متن کاملSolving the Phantom Problem by Predicative Optimistic Concurrency Control
Database programming languages provide powerful telationai structures and operators based on, for exampb, first-order predicate calculus. Language Constructs for database programming, including a tmnsaction concepC requite thsrefof’e a predttteorbnted approach to con~m~lcy c~ntrool. A predicative optimistic concunency control is presented that attacks problems inhefwt in predtcate locking. Oniy...
متن کاملObservations on optimistic concurrency control schemes
Attstraet-Gptimistic concurrency control schemes allow uncontrolled access to shared data objects during transaction processing under the explicit assumption that read and write coticts among transactions are rare events. Before a transaction commits, the DBMS has to validate that no conflict has occurred Conflict resolution mainly relies on transaction abort. Two different optimistic concurren...
متن کاملTitle : Bounded Locking for Optimistic Concurrency Control
Optimistic methods of concurrency control are gaining popularity. This is especially true with the resurgence of mobile and distributed databases, which inherently rely on optimistic techniques to improve availability and performance of the database system. A key problem with optimistic techniques is that they do not perform well in highly conflict prone environments. Pessimistic techniques, es...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the VLDB Endowment
سال: 2011
ISSN: 2150-8097
DOI: 10.14778/3402707.3402732